A Collective, Probabilistic Approach to Schema Mapping: Appendix

We extend the running example from the main paper to illustrate objective Eq. (9) of [1]. We use a reduced candidate set C = {θ1, θ3} (Figure 1(d) in [1]) and the data in Figure 1(b)-(c) in [1], but omit the leader relation. A universal solution Kθ1 of I contains the task tuples (BigData, Bob, Null1) and (ML, Alice, Null2), while a Kθ3 contains the task tuples (BigData, Bob, Null3) and (ML, Alice, Null4) and the org tuples (Null3, IBM) and (Null4, SAP).